Further Results on Complementary Super Edge Magic Graph Labeling

نویسندگان

  • Neelam Kumari
  • Seema Mehra
چکیده

Abstract : In this paper we introduced the concept of complementary super edge magic labeling and Complementary Super Edge Magic strength of a graph G.A graph G (V, E ) is said to be complementary super edge magic if there exist a bijection f:V U E → { 1, 2, ............p+q } such that p+q+1 f(x) is constant. Such a labeling is called complementary super edge magic labeling with complementary super edge magic strength. In this paper for a graph G(V, E ) the complementary super edge magic labeling and minimum of all constants which is called complementary super edge magic strength of G is defined. In this paper, we investigate whether some families of graphs are complementary or not?

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mixed cycle-E-super magic decomposition of complete bipartite graphs

An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) +  ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...

متن کامل

Mixed cycle-E-super magic decomposition of complete bipartite graphs

An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...

متن کامل

On Super Edge-magic Total Labeling of Reflexive W-trees

ON SUPER EDGE-MAGIC TOTAL LABELING OF REFLEXIVE W-TREES Muhammad Imran, Mehar Ali Malik, M. Yasir Hayat Malik Department of Mathematics, School of Natural Sciences (SNS), National University of Sciences and Technology (NUST), Islamabad, Pakistan. E-mail: {imrandhab, alies.camp, yasirmalikawan}@gmail.com Mathematics Subject Classification: 05C78 ABSTRACT. Kotzig and Rosa [17] defined a magic lab...

متن کامل

New Constructions of Edge Bimagic Graphs from Magic Graphs

An edge magic total labeling of a graph G(V,E) with p vertices and q edges is a bijection f from the set of vertices and edges to such that for every edge uv in E, f(u) + f(uv) + f(v) is a constant k. If there exist two constants k1 and k2 such that the above sum is either k1 or k2, it is said to be an edge bimagic total labeling. A total edge magic (edge bimagic) graph is called a super edge m...

متن کامل

Magic Properties of Special Class of Trees

In this paper, we consider special class of trees called uniform k-distant trees, which have many interesting properties. We show that they have an edge-magic total labeling, a super edge-magic total labeling, a (a, d)-edge-antimagic vertex labeling, an (a, d)-edgeantimagic total labeling, a super (a, d)edge-antimagic total labeling. Also we introduce a new labeling called edge bi-magic vertex ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013